The Dynamics of Group Codes: Dual Abelian Group Codes and Systems
نویسندگان
چکیده
منابع مشابه
Two Sided and Abelian Group Ring Codes
2 In the hallway of the university Wittgenstein asked a colleague: " I've always wondered why for so long people thought that the sun revolved around the earth. " " Why? " said his surprised interlocutor, " well, I suppose it just looks that way. " " Hmm " , retorted Wittgenstein, " and what would it look like if the earth revolved around the sun? " This puzzled the interlocutor.
متن کاملDistributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the problem of computing a function of the sources to within some distortion and also the classic Slepian-Wolf problem [62], Berger-Tung problem [46], Wyner-Ziv problem [44], Yeung-Berger problem [47] and the Ahlswede-Ko...
متن کاملThe capacity of Abelian group codes over symmetric channels
In this paper the capacity achievable by Abelian group codes when employed over symmetric channels is determined. For certain important examples, like the AWGN channel with m-PSK modulation, it follows that this capacity coincides with the corresponding Shannon capacity of these channels. In other words using Abelian group codes in this case there is no loss of capacity (as it happens for binar...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملAbelian Group Codes for Source Coding and Channel Coding
In this paper, we study the asymptotic performance of Abelian group codes for the lossy source coding problem for arbitrary discrete (finite alphabet) memoryless sources as well as the channel coding problem for arbitrary discrete (finite alphabet) memoryless channels. For the source coding problem, we derive an achievable rate-distortion function that is characterized in a single-letter inform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2004
ISSN: 0018-9448
DOI: 10.1109/tit.2004.838340